CONVEXITY of PRODUCTION, COMMON POOL and OLIGOPOLY GAMES

نویسندگان

  • Theo DRIESSEN
  • Holger MEINHARDT
چکیده

A cooperative game with transferable utility (TU) is a pair 〈N, v〉, where N is a nonempty, finite set and v : 2N → R is a characteristic function, defined on the power set of N , satisfying v(∅) := 0. An element of N (notation: i ∈ N) and a nonempty subset S of N (notation: S ⊆ N or S ∈ 2N with S 6= ∅) is called a player and coalition respectively, and the associated real number v(S) is called the worth of coalition S. Concerning the modelling part of game theory, it is customary to investigate whether or not any appropriate class of cooperative TU games satisfies one or another appealing property. Without going into details, we state that the so-called convexity property of the characteristic function v is a widely-spread concept through the game theory literature. Any cooperative TU game 〈N, v〉 is said to be a convex game (cf. Shapley, [6], 1971) if it holds v(S) + v(T ) ≤ v(S ∪ T ) + v(S ∩ T ) for all S, T ⊆ N or equivalently, for all i ∈ N , j ∈ N , i 6= j, and all S ⊆ N\{i, j}, it holds

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

(Average-) convexity of Common Pool and Oligopoly TU-Games

The paper studies both the convexity and average-convexity properties for a particular class of cooperative TU-games called common pool games. The common pool situation involves a cost function as well as a (weakly decreasing) average joint production function. Firstly, it is shown that, if the relevant cost function is a linear function, then the common pool games are convex games. The convexi...

متن کامل

A necessary and sufficient condition for the convexity in oligopoly games

This paper establishes a necessary and sufficient condition for the convexity (or supermodularity) in oligopoly games.  1999 Elsevier Science B.V. All rights reserved.

متن کامل

On the Supermodularity of Oligopoly Games

The main purpose is to prove the supermodularity (convexity) property of a cooperative game arising from an economical situation. The underlying oligopoly situation is based on a linear inverse demand function as well as linear cost functions for the participating firms. The characteristic function of the so-called oligopoly game is determined by maximizing, for any cartel of firms, the net pro...

متن کامل

Convexity and the Shapley value in Bertrand oligopoly TU-games with Shubik's demand functions

The Bertrand Oligopoly situation with Shubik’s demand functions is modelled as a cooperative TU game. For that purpose two optimization problems are solved to arrive at the description of the worth of any coalition in the so-called Bertrand Oligopoly Game. Under certain circumstances, this Bertrand oligopoly game has clear affinities with the well-known notion in statistics called variance with...

متن کامل

Stable Coalition Structures under Restricted coalitional changes

In this paper, we examine whether farsighted players form the e¢ cient grand coalition structure in coalition formation games. We propose a stability concept for a coalition structure, called sequentially stability, when only bilateral mergers of two separate coalitions are feasible because of high negotiation costs. We provide an algorithm to check the sequential stability of the grand coaliti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004